翻訳と辞書 Words near each other ・ Multi-service business gateway ・ Multi-booting ・ Multi-boxing ・ Multi-carrier code division multiple access ・ Multi-channel analytics ・ Multi-channel app development ・ Multi-channel length ・ Multi-channel memory architecture ・ Multi-channel network ・ Multi-channel transition ・ Multi-chip module ・ Multi-Choice TV (Barbados) ・ Multi-Color Graphics Array ・ Multi-Coloured Swap Shop ・ Multi-coloured tree frog ・ Multi-commodity flow problem ・ Multi-compartment model ・ Multi-competence ・ Multi-component reaction ・ Multi-configuration time-dependent Hartree ・ Multi-configurational self-consistent field ・ Multi-conjugate Adaptive optics Demonstrator ・ Multi-cordoned ware culture ・ Multi-core processor ・ Multi-course harp ・ Multi-currency pricing ・ Multi-cylinder engine ・ Multi-day race ・ Multi-dimensional model of leadership ・ Multi-dimensional model of Maori identity and cultural engagement Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Multi-commodity flow problem ： ウィキペディア英語版 Multi-commodity flow problem The multi-commodity flow problem is a network flow problem with multiple commodities (flow demands) between different source and sink nodes. ==Definition== Given a flow network $\backslash ,G(V,E)$, where edge $(u,v)\; \backslash in\; E$ has capacity $\backslash ,c(u,v)$. There are $\backslash ,k$ commodities $K\_1,K\_2,\backslash dots,K\_k$, defined by $\backslash ,K\_i=(s\_i,t\_i,d\_i)$, where $\backslash ,s\_i$ and $\backslash ,t\_i$ is the source and sink of commodity $\backslash ,i$, and $\backslash ,d\_i$ is the demand. The flow of commodity $\backslash ,i$ along edge $\backslash ,(u,v)$ is $\backslash ,f\_i(u,v)$. Find an assignment of flow which satisfies the constraints: : f_i(u,v) \leq c(u,v) |- | Flow conservation: || $\backslash ,\backslash sum\_\; f\_i(u,w)\; =\; 0\; \backslash quad\; \backslash mathrm\; \backslash quad\; u\; \backslash neq\; s\_i,\; t\_i$ |- |||$\backslash ,\backslash forall\; v,\; u,\backslash ,\; f\_i(u,v)\; =\; -f\_i(v,u)$ |- | Demand satisfaction: || $\backslash ,\backslash sum\_\; f\_i(s\_i,w)\; =\; \backslash sum\_\; f\_i(w,t\_i)\; =\; d\_i$ |} In the minimum cost multi-commodity flow problem, there is a cost $a(u,v)\; \backslash cdot\; f(u,v)$ for sending flow on $\backslash ,(u,v)$. You then need to minimize :$\backslash sum\_\; \backslash left(\; a(u,v)\; \backslash sum\_^\; f\_i(u,v)\; \backslash right)$ In the maximum multi-commodity flow problem, there are no hard demands on each commodity, but the total throughput is maximised: :$\backslash sum\_^\; \backslash sum\_\; f\_i(s\_i,w)$ In the maximum concurrent flow problem, the task is to maximise the minimal fraction of the flow of each commodity to its demand: :$\backslash min\_\; \backslash frac$ 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Multi-commodity flow problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.